Simplified Implementation of the MAP Decoder

نویسنده

  • Shouvik Ganguly
چکیده

In this report, I have studied a simplification, suggested by Viterbi [1], to the BCJR algorithm for the bitwise MAP decoder for convolutional and turbo codes. The simplifications involve reduction in both computational complexity and memory requirements, using, first, a good approximation to the metric update rules for BCJR algorithm and, second, a scheduling algorithm to reduce memory requirements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An FPGA realization of simplified turbo decoder architecture

The key issue of applying Turbo codes is to find an efficient implementation of turbo decoder. This paper addresses the implementation of a simplified and efficient turbo decoder in field programmable gate array (FPGA) technology. A simplified and efficient implementation of a Turbo decoder with minor performance loss has been proposed. An integer Turbo decoder based on the standard 2’s complem...

متن کامل

Simplified MAP Algorithm Suitable for Implementation of Turbo Decoders

A simplification of the MAP decoder for use in turbo decoders is presented. The simplification eliminates the need for a ROM or multiplexor-tree lookup table and replaces it with a constant value. Simulations show that the performance of turbo decoders is not adversely affected by this simplification.

متن کامل

A Novel Design of a Multi-layer 2:4 Decoder using Quantum- Dot Cellular Automata

The quantum-dot cellular automata (QCA) is considered as an alternative tocomplementary metal oxide semiconductor (CMOS) technology based on physicalphenomena like Coulomb interaction to overcome the physical limitations of thistechnology. The decoder is one of the important components in digital circuits, whichcan be used in more comprehensive circuits such as full adde...

متن کامل

An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes

An intuitive shortcut to understanding the maximum a posteriori (MAP) decoder is presented based on an approximation. This is shown to correspond to a dual-maxima computation combined with forward and backward recursions of Viterbi algorithm computations. The logarithmic version of the MAP algorithm can similarly be reduced to the same form by applying the same approximation. Conversely, if a c...

متن کامل

VLSI Design & Implementation of High-Throughput Turbo Decoder for Wireless Communication Systems

Each evolution of wireless communication system demands ever increasing growth in the rate of data transmission with no sign of pause. The demand of higher data-rate, exhibited by increasing users of mobile wireless services, has been on an exponential trajectory. To meet such requirement of data-rate, wireless industry has already specified to further augment data rates up to 3 Gbps milestone ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015